Which circulant preconditioner is better?
نویسندگان
چکیده
The eigenvalue clustering of matrices S−1 n An and C −1 n An is experimentally studied, where An, Sn and Cn respectively are Toeplitz matrices, Strang, and optimal circulant preconditioners generated by the Fourier expansion of a function f(x). Some illustrations are given to show how the clustering depends on the smoothness of f(x) and which preconditioner is preferable. An original technique for experimental exploration of the clustering rate is presented. This technique is based on the bisection idea and on the Toeplitz decomposition of a three-matrix product CAC, where A is a Toeplitz matrix and C is a circulant. In particular, it is proved that the Toeplitz (displacement) rank of CAC is not greater than 4, provided that C and A are symmetric.
منابع مشابه
A unifying approach to the construction of circulant preconditioners
The main result is the “black dot algorithm” and its fast version for the construction of a new circulant preconditioner for Toeplitz matrices. This new preconditioner C is sought directly as a solution to one of possible settings of the approximation problem A ≈ C + R, where A is a given matrix and R should be a “low-rank” matrix. This very problem is a key to the analysis of superlinear conve...
متن کاملPreconditioning Techniques for Diagonal-times-Toeplitz Matrices in Fractional Diffusion Equations
The fractional diffusion equation is discretized by an implicit finite difference scheme with the shifted Grünwald formula, which is unconditionally stable. The coefficient matrix of the discretized linear system is equal to the sum of a scaled identity matrix and two diagonal-times-Toeplitz matrices. Standard circulant preconditioners may not work for such Toeplitz-like linear systems. The mai...
متن کاملAccelerating CS in Parallel Imaging Reconstructions Using an Efficient and Effective Circulant Preconditioner
Purpose: Design of a preconditioner for fast and efficient parallel imaging and compressed sensing reconstructions. Theory: Parallel imaging and compressed sensing reconstructions become time consuming when the problem size or the number of coils is large, due to the large linear system of equations that has to be solved in l1 and l2-norm based reconstruction algorithms. Such linear systems can...
متن کاملGeneralization of Strang's Preconditioner with Applications to Toeplitz Least Squares Problems
In this paper, we propose a method to generalize Strang's circulant preconditioner for arbitrary n-by-n matrices An. The n 2 th column of our circulant preconditioner Sn is equal to the n 2 th column of the given matrix An. Thus if An is a square Toeplitz matrix, then Sn is just the Strang circulant preconditioner. When Sn is not Hermitian, our circulant preconditioner can be deened as (S n Sn)...
متن کاملGeneralized circulant Strang-type preconditioners
SUMMARY Strang's proposal to use a circulant preconditioner for linear systems of equations with a Hermitian positive definite Toeplitz matrix has given rise to considerable research on circulant preconditioners. This paper presents an {e iϕ }-circulant Strang-type preconditioner.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996